Representing integers as linear combinations of powers

نویسندگان

  • Lajos Hajdu
  • Robert Tijdeman
چکیده

At a conference in Debrecen in October 2010 Nathanson announced some results concerning the arithmetic diameters of certain sets. (See his paper in the present volume.) He proposed some related problems on the representation of integers by sums or differences of powers of 2 and of 3. In this note we prove some results on this problem and the more general problem about the representation by linear combinations of powers of some fixed integers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Representing algebraic integers as linear combinations of units

In this paper we consider representations of algebraic integers of a number field as linear combinations of units with coefficients coming from a fixed small set, and as sums of elements having small norms in absolute value. These theorems can be viewed as results concerning a generalization of the so-called unit sum number problem, as well. Beside these, extending previous related results we g...

متن کامل

Suppression of Four Wave Mixing Based on the Pairing Combinations of Differently Linear-Polarized Optical Signals in WDM System

Data transmission in optical systems and increased transmission distance capacity benefit by using optical amplification wavelength division multiplexing (WDM) technology. The combination of four waves (FWM) is a non-linear effect in the wavelength division multiplex (WDM), when more than two wavelengths of light in a fiber launch will occur. FWM amount depends on the channel, the channel spaci...

متن کامل

Linear algebra and the sums of powers of integers

A general framework based on linear algebra is presented to obtain old and new polynomial expressions for the sums of powers of integers. This framework uses changes of polynomial basis, infinite lower triangular matrices and finite differences.

متن کامل

Quarternions and the Four Square Theorem

The Four Square Theorem was proved by Lagrange in 1770: every positive integer is the sum of at most four squares of positive integers, i.e. n = A2 + B2 + C2 + D2, A, B, C, D ∈ Z An interesting proof is presented here based on Hurwitz integers, a subset of quarternions which act like integers in four dimensions and have the prime divisor property. It is analogous to Fermat’s Two Square Theorem,...

متن کامل

Distribution of Powers modulo 1 and Relatedtopicsmiguel

This is a review of several results related to distribution of powers and combinations of powers modulo 1. We include a proof that given any sequence of real numbers n , it is possible to get an (given 6 = 0), or a (given > 1) such that n is close to n modulo 1. We also prove that in a number eld, if a combination of powers 1 n 1 + + m n m has bounded v-adic absolute value (where v is any non-A...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011